منابع مشابه
Non-separating subgraphs
Lovász conjectured that there is a smallest integer f (l) such that for every f (l)-connected graph G and every two vertices s, t of G there is a path P connecting s and t such that G − V (P) is l-connected. This conjecture is still open for l ≥ 3. In this paper, we generalize this conjecture to a k-vertex version: is there a smallest integer f (k, l) such that for every f (k, l)-connected grap...
متن کاملNon-separating subgraphs after deleting many disjoint paths
Motivated by the well-known conjecture by Lovász [6] on the connectivity after the path removal, we study the following problem: There exists a function f = f(k, l) such that the following holds. For every f(k, l)connected graph G and two distinct vertices s and t in G, there are k internally disjoint paths P1, . . . , Pk with endpoints s and t such that G− ⋃k i=1 V (Pi) is l-connected. When k ...
متن کاملOn the number of non-isomorphic subgraphs
Let K be the family of graphs on ω1 without cliques or independent subsets of size ω1. We prove that (a) it is consistent with CH that every G ∈ K has 21 many pairwise non-isomorphic subgraphs, (b) the following proposition holds in L: (∗) there is a G ∈ K such that for each partition (A,B) of ω1 either G ∼= G[A] or G ∼= G[B], (c) the failure of (∗) is consistent with ZFC.
متن کاملLargest non - unique subgraphs by Lars
The reduction number r(G) of a graph G is the maximum integer m ≤ |E(G)| such that the graphs G − E,E ⊆ E(G), |E| ≤ m, are mutually non-isomorphic, i.e., each graph is unique as a subgraph of G. We prove that r(G) ≤ |V (G)| 2 +1 and show by probabilistic methods that r(G) can come close to this bound for large orders. By direct construction, we exhibit graphs with large reduction number, althou...
متن کاملSubgraphs in Non-uniform Random Hypergraphs
Myriad problems can be described in hypergraph terms. However, the theory and tools are not sufficiently developed to allow most problems to be tackled directly within this context. The main purpose of this paper is to increase the awareness of this important gap and to encourage the development of this formal theory, in conjunction with the consideration of concrete applications. As a starting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.11.004